Circulants and critical points of polynomials
نویسندگان
چکیده
منابع مشابه
Non-accessible Critical Points of Cremer Polynomials
It is shown that a polynomial with a Cremer periodic point has a non-accessible critical point in its Julia set provided that the Cremer periodic point is approximated by small cycles. Stony Brook IMS Preprint #1995/2 February 1995
متن کاملOn the Location of Critical Points of Polynomials
Given a polynomial p of degree n ≥ 2 and with at least two distinct roots let Z(p) = {z : p(z) = 0}. For a fixed root α ∈ Z(p) we define the quantities ω(p, α) := min { |α − v| : v ∈ Z(p) \ {α} } and τ(p, α) := min { |α − v| : v ∈ Z(p′) \ {α} } . We also define ω(p) and τ(p) to be the corresponding minima of ω(p, α) and τ(p, α) as α runs over Z(p). Our main results show that the ratios τ(p, α)/...
متن کاملIndependence polynomials of circulants with an application to music
The independence polynomial of a graph G is the generating function I(G, x) = ∑ k≥0 ikx k, where ik is the number of independent sets of cardinality k in G. We show that the problem of evaluating the independence polynomial of a graph at any fixed non-zero number is intractable, evenwhen restricted to circulants. We provide a formula for the independence polynomial of a certain family of circul...
متن کاملApproximation by Critical Points of Generalized Chebyshev Polynomials
We show that any compact, connected set in the plane can be approximated by the critical points of a polynomial with only two critical values. Date: April 2011. 1991 Mathematics Subject Classification. Primary: 30C62 Secondary:
متن کاملOn Circulants Uniquely Characterized by their Independence Polynomials
In [18], Farrell and Whitehead investigate circulant graphs that are uniquely characterized by their matching and chromatic polynomials (i.e., graphs that are “matching unique” and “chromatic unique”). They develop a partial classification theorem, by finding all matching unique and chromatic unique circulants on n vertices, for each n ≤ 8. In this paper, we explore circulant graphs that are un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2016
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2016.03.005